Using sequences of local minima/maxima for on-line cursive letter recognition

نویسنده

  • Robert Powalka
چکیده

A recognition process is based on a comparison of an object to be identified (recognized) with objects known by the subject performing the recognition. In case of machine letter recognition this process is performed by a computer and software implemented on it and the objects to be recognized are letters. For on-line recognition letters are supplied as a set of consecutive coordinates of the pen tip position as it moves along the path forming the shape of a letter. The recognition algorithm may attempt to compare the input shape directly with ones “known” to it, or it may attempt to extract certain features which characterize the shape and compare only those with the reference feature sets “known”. The latter approach has the potential of being more flexible and robust, as the well chosen feature set will tolerate various distortions of shapes/patterns to be recognized.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On-line cursive letter recognition using sequences of local minima/maxima

This report presents the design and implementation of an on-line cursive letter recognizer using sequences of local extrema. Recognition tests were performed on single writer's data. The results for top five alternatives exceeded 90% (Table 4). The matching is performed in three stages: • letter size normalisation (Figure 1); • limiting the recognition domain using sequences of local extrema an...

متن کامل

Different method of extracting sequences of local minima/maxima for on-line cursive letter recognition

The mechanism of coping with co-linear horizontal or vertical points is depicted in Figure 2. When horizontal or vertical co-linear points are found, very little adjustments are applied to coordinates of the points. The adjustments are applied in such a way, that the polyline increases its “smoothness”. Three different cases can be distinguished: point of inflection (Figure 2a), real extremum (...

متن کامل

Low-Level Cursive Word Representation Based on Geometric Decomposition

An efficient low-level word image representation plays a crucial role in general cursive word recognition. This paper proposes a novel representation scheme, where a word image can be represented as two sequences of feature vectors in two independent channels, which are extracted from vertical peak points on the upper external contour and at vertical minima on the lower external contour, respec...

متن کامل

Precise Hand-printed Character Recognition Using Elastic Models via Nonlinear Transformation

Distorted character recognition is a difficult but inevitable problem in hand-printed character recognition. In this paper, we propose a character recognition method using elastic models for recognizing cursive characters with intricate structure. The models are fitted to unknown input patterns by applying the EM algorithm to minimize a measure of fittness. To avoid falling into local minima, m...

متن کامل

Neural Network Learning Through Optimally Conditioned Quadratically Convergent Methods Requiring NO LINE SEARCH

Neural Network Learning algorithms based on Conjugate Gradient Techniques and Quasi Newton Techniques such as Broyden, DFP, BFGS, and SSVM algorithms require exact or inexact line searches in order to satisfy their convergence criteria. Line searches are very costly and slow down the learning process. This paper will present new Neural Network learning algorithms based on Hoshino's weak line se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993